#include <bits/stdc++.h>
#define int long long
#define pii pair <int,int>
#define st first
#define nd second
#define vi vector <int>
#define vpii vector <pii>
#define pb push_back
#define pf push_front
#define FOR(a, b, c) for (int i = a; i <= b; i += c)
#define ROS(a, b, c) for (int i = a; i >= b; i -= c)
#define lb lower_bound
#define ub upper_bound
#define FILE ""
#define trii pair <int, pii>
using namespace std;
const int oo = 1e18;
const int N = 500 + 9;
const int mod = 1e9 + 7;
const int blocks = 448;
int n, k, a[N];
int res, f[N][N];
string s;
int dp(int l, int r)
{
int &res = f[l][r];
if (res != -1) return res;
if (l > r) return res = 0;
if (l == r) return res = 1;
res = dp(l + 1, r) + 1;
for (int i = l + 1; i <= r; i++)
{
if (s[i] == s[l])
{
res = min(res, dp(l + 1, i - 1) + dp(i, r));
}
}
return res;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
//freopen(FILE".inp","r", stdin);
//freopen(FILE".out","w", stdout);
cin >> n >> s;
memset(f, -1, sizeof(f));
int ans = dp(0, n - 1);
cout << ans;
return 0;
}
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |